Recursive expectation-maximization clustering: A method for identifying buffering mechanisms composed of phenomic modules
نویسندگان
چکیده
منابع مشابه
Expectation-Maximization Binary Clustering for Behavioural Annotation
The growing capacity to process and store animal tracks has spurred the development of new methods to segment animal trajectories into elementary units of movement. Key challenges for movement trajectory segmentation are to (i) minimize the need of supervision, (ii) reduce computational costs, (iii) minimize the need of prior assumptions (e.g. simple parametrizations), and (iv) capture biologic...
متن کاملExpectation Maximization for Clustering on Hyperspheres
High dimensional directional data is becoming increasingly important in contemporary applications such as analysis of text and gene-expression data. A natural model for multi-variate directional data is provided by the von Mises-Fisher (vMF) distribution on the unit hypersphere that is analogous to multi-variate Gaussian distribution in R. In this paper, we propose modeling complex directional ...
متن کاملChemical Reaction Algorithm for Expectation Maximization Clustering
Clustering is an intensive research for some years because of its multifaceted applications, such as biology, information retrieval, medicine, business and so on. The expectation maximization (EM) is a kind of algorithm framework in clustering methods, one of the ten algorithms of machine learning. Traditionally, optimization of objective function has been the standard approach in EM. Hence, re...
متن کاملIdentifying the Stances of Topic Persons Using a Model-based Expectation-Maximization Method
Identifying persons with the same stance in topic documents that contain competing viewpoints can help readers construct the background of a topic and facilitate topic reading. In this paper, we propose an unsupervised method for identifying topic persons with the same stance. Specifically, we employ a model-based Expectation-Maximization (EM) method to cluster individuals into positively corre...
متن کاملA Practical Method for Self-adapting Gaussian Expectation Maximization
Split-and-merge techniques have been demonstrated to be effective in overtaking the convergence problems in classical EM. In this paper we follow a split-and-merge approach and we propose a new EM algorithm that makes use of a on-line variable number of mixture Gaussians components. We introduce a measure of the similarities to decide when to merge components. A set of adaptive thresholds keeps...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chaos: An Interdisciplinary Journal of Nonlinear Science
سال: 2010
ISSN: 1054-1500,1089-7682
DOI: 10.1063/1.3455188